Directed and antidirected Hamiltonian cycles and paths in bipartite graphs
نویسندگان
چکیده
منابع مشابه
Hamiltonian Paths and Cycles in Planar Graphs
We examine the problem of counting the number of Hamiltonian paths and Hamiltonian cycles in outerplanar graphs and planar graphs, respectively. We give an O(nαn) upper bound and an Ω(αn) lower bound on the maximum number of Hamiltonian paths in an outerplanar graph with n vertices, where α ≈ 1.46557 is the unique real root of α = α + 1. For any positive integer n ≥ 6, we define an outerplanar ...
متن کاملContracting Bipartite Graphs to Paths and Cycles
Testing if a given graph G contains the k-vertex path Pk as a minor or as an induced minor is trivial for every fixed integer k ≥ 1. However, the situation changes for the problem of checking if a graph can be modified into Pk by using only edge contractions. In this case the problem is known to be NP-complete even if k = 4. This led to an intensive investigation for testing contractibility on ...
متن کاملDisjoint hamiltonian cycles in bipartite graphs
Let G = (X, Y ) be a bipartite graph and define σ 2(G) = min{d(x) + d(y) : xy / ∈ E(G), x ∈ X, y ∈ Y }. Moon and Moser [5] showed that if G is a bipartite graph on 2n vertices such that σ 2(G) ≥ n + 1 then G is hamiltonian, sharpening a classical result of Ore [6] for bipartite graphs. Here we prove that if G is a bipartite graph on 2n vertices such that σ 2(G) ≥ n+ 2k− 1 then G contains k edge...
متن کاملHamiltonian Cycles in Directed Toeplitz Graphs
Hamiltonian Cycles in Directed Toeplitz Graphs Dr Shabnam Malik Faculty of Mathematics, Forman Christian College University, Lahore Pakistan An (n × n) matrix A = (aij) is called a Toeplitz matrix if it has constant values along all diagonals parallel to the main diagonal. A directed Toeplitz graph is a digraph with Toeplitz adjacency matrix. In this talk I will discuss conditions for the exist...
متن کاملIndependent cycles and paths in bipartite balanced graphs
Bipartite graphs G = (L, R; E) and H = (L, R; E) are bi-placeabe if there is a bijection f : L ∪ R → L ∪ R such that f(L) = L and f(u)f(v) / ∈ E for every edge uv ∈ E. We prove that if G and H are two bipartite balanced graphs of order |G| = |H | = 2p ≥ 4 such that the sizes of G and H satisfy ‖ G ‖≤ 2p− 3 and ‖ H ‖≤ 2p− 2, and the maximum degree of H is at most 2, then G and H are bi-placeable...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Banach Center Publications
سال: 1989
ISSN: 0137-6934,1730-6299
DOI: 10.4064/-25-1-39-46